118,776 research outputs found

    New identities involving q-Euler polynomials of higher order

    Full text link
    In this paper we give new identities involving q-Euler polynomials of higher order.Comment: 11 page

    Multivariate p-dic L-function

    Full text link
    We construct multivariate p-adic L-function in the p-adic number fild by using Washington method.Comment: 9 page

    A note on q-Bernstein polynomials

    Full text link
    In this paper we constructed new q-extension of Bernstein polynomials. Fron those q-Berstein polynomials, we give some interesting properties and we investigate some applications related this q-Bernstein polynomials.Comment: 13 page

    Quantum network architecture of tight-binding models with substitution sequences

    Full text link
    We study a two-spin quantum Turing architecture, in which discrete local rotations \alpha_m of the Turing head spin alternate with quantum controlled NOT-operations. Substitution sequences are known to underlie aperiodic structures. We show that parameter inputs \alpha_m described by such sequences can lead here to a quantum dynamics, intermediate between the regular and the chaotic variant. Exponential parameter sensitivity characterizing chaotic quantum Turing machines turns out to be an adequate criterion for induced quantum chaos in a quantum network.Comment: Accepted for publication in J. mod. Optics [Proc. Workshop "Entanglement and Decoherence", Gargnano (Italy), Sept 1999], 3 figure

    Higher-Dimensional QCD without the Strong CP Problem

    Get PDF
    QCD in a five-dimensional sliced bulk with chiral extra-quarks on the boundaries is generically free from the strong CP problem. Accidental axial symmetry is naturally present except for suppressed breaking interactions, which plays a role of the Peccei-Quinn symmetry to make the strong CP phase sufficiently small.Comment: 7 pages, late

    Heparin-containing block copolymers, Part I: Surface characterization

    Get PDF
    Newly synthesized heparin-containing block copolymers, consisting of a hydrophobic block of polystyrene (PS), a hydrophilic spacer-block of poly(ethylene oxide) (PEO) and covalently bound heparin (Hep) as bioactive block, were coated on aluminium, glass, polydimethylsiloxane (PDMS), PS or Biomer substrates. Surfaces of coated materials were characterized by transmission electron microscopy (TEM), contact angle measurements and X-ray photoelectron spectroscopy for chemical analysis (XPS). It was demonstrated by TEM that thin films of PS-PEO and PS-PEO-Hep block copolymers consisted of heterogeneous microphase separated structures. Using sessile-drop and Wilhelmy plate dynamic contact angle measurements, insight was provided into the hydrophilicity of the surfaces of the coatings. Measurements with hydrated coatings of PS-PEO and PS-PEO-Hep block copolymers revealed that the surfaces became more hydrophilic during immersion in water, due to relaxation/reorientation, or swelling of PEO or PEO-Hep domains, respectively. XPS results for PS, PEO, heparin and PS-PEO as powder agreed well with qualitative and quantitative predictions. XPS results for films of PS-PEO and PS-PEO-Hep block copolymers showed enrichments of PEO in the top layers of the coatings. This effect was more pronounced for hydrated surfaces. Only small amounts of heparin were detected at the surface of coatings of PS-PEO-Hep block copolymers

    A box-covering algorithm for fractal scaling in scale-free networks

    Full text link
    A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box, and thereby, vertices in preassigned boxes can divide subsequent boxes into more than one pieces, but divided boxes are counted once. We find that such box-split allowance in the algorithm is a crucial ingredient necessary to obtain the fractal scaling for fractal networks; however, it is inessential for regular lattice and conventional fractal objects embedded in the Euclidean space. Next the algorithm is viewed from the cluster-growing perspective that boxes are allowed to overlap and thereby, vertices can belong to more than one box. Then, the number of distinct boxes a vertex belongs to is distributed in a heterogeneous manner for SF fractal networks, while it is of Poisson-type for the conventional fractal objects.Comment: 12 pages, 11 figures, a proceedings of the conference, "Optimization in complex networks." held in Los Alamo
    corecore